Covering a Polish group by translates of a nowhere dense set
نویسندگان
چکیده
منابع مشابه
The number of translates of a closed nowhere dense set required to cover a Polish group
For a Polish group G let covG be the minimal number of translates of a fixed closed nowhere dense subset of G required to cover G. For many locally compact G this cardinal is known to be consistently larger than cov(M) which is the smallest cardinality of a covering of the real line by meagre sets. It is shown that for several non-locally compact groups covG = cov(M). For example the equality h...
متن کاملOn covering by translates of a set
In this paper we study the minimal number τ(S,G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups, reviewing the classical results in this area, and generalizing them to a much broader context. For example, we show that while the worst-case efficiency when ...
متن کاملModels in which every nonmeager set is nonmeager in a nowhere dense Cantor set
We prove that it is relatively consistent with ZFC that in any perfect Polish space, for every nonmeager set A there exists a nowhere dense Cantor set C such that A∩C is nonmeager in C. We also examine variants of this result and establish a measure theoretic analog.
متن کاملOn nowhere dense and somewhere dense - a graph trichotomy
Motivated by structural decompositions and other asymptotic properties of graphs we define the notions in the title and show the wide spectrum of examples of nowhere dense graphs. This has several algorithmic consequences and it generalizes and improves earlier results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2008
ISSN: 0166-8641
DOI: 10.1016/j.topol.2008.02.010